Solving wind farm layout optimization with mixed integer programs and constraint programs
نویسندگان
چکیده
منابع مشابه
Solving Wind Farm Layout Optimization with Mixed Integer Programming and Constraint Programming
The wind farm layout optimization problem is concerned with the optimal location of turbines within a fixed geographical area to maximize energy capture under stochastic wind conditions. Previously it has been modelled as a maximum diversity (or p-dispersion-sum) problem, but such a formulation cannot capture the nonlinearity of aerodynamic interactions among multiple wind turbines. We present ...
متن کاملSCIP: solving constraint integer programs
Constraint integer programming (CIP) is a novel paradigm which integrates constraint programming (CP), mixed integer programming (MIP), and satisfiability (SAT) modeling and solving techniques. In this paper we discuss the software framework and solver SCIP (Solving Constraint Integer Programs), which is free for academic and non-commercial use and can be downloaded in source code. This paper g...
متن کاملExplicit-Constraint Branching for Solving Mixed- Integer Programs
This paper develops a new generalized-branching technique called “explicitconstraint branching” (ECB) to improve the performance of branch-andbound algorithms for solving mixed-integer programs (MIPs). ECB adds structure to a MIP, in the form of auxiliary constraints and auxiliary integer variables, to allow branching on groups of (original) integer variables that would not otherwise be possibl...
متن کاملExploiting Solving Phases for Mixed-Integer Programs
Modern MIP solving software incorporates dozens of auxiliary algorithmic components for supporting the branch-and-bound search in finding and improving solutions and in strengthening the relaxation. Intuitively, a dynamic solving strategy with an appropriate emphasis on different solving components and strategies is desirable during the search process. We propose an adaptive solver behavior tha...
متن کاملSolving Mixed-Integer Nonlinear Programs using Adaptively Refined Mixed-Integer Linear Programs
We propose a method for solving mixed-integer nonlinear programs (MINLPs) to global optimality by discretization of occuring nonlinearities. The main idea is based on using piecewise linear functions to construct mixed-integer linear program (MIP) relaxations of the underlying MINLP. In order to find a global optimum of the given MINLP we develope an iterative algorithm which solves MIP relaxat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO Journal on Computational Optimization
سال: 2014
ISSN: 2192-4406,2192-4414
DOI: 10.1007/s13675-014-0024-5